An identification system based on the explicit isomorphism problem
نویسندگان
چکیده
Abstract We propose a new identification system based on algorithmic problems related to computing isomorphisms between central simple algebras. design statistical zero knowledge protocol which relies the hardness of orders in division algebras generalizes by Hartung and Schnorr, integral equivalence quadratic forms.
منابع مشابه
Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem
This paper presents a practical cryptanalysis of the Identification Scheme proposed by Patarin at Crypto 1996. This scheme relies on the hardness of the Isomorphism of Polynomial with One Secret (IP1S), and enjoys shorter key than many other schemes based on the hardness of a combinatorial problem (as opposed to numbertheoretic problems). Patarin proposed concrete parameters that have not been ...
متن کاملOn the Lattice Isomorphism Problem
We study the Lattice Isomorphism Problem (LIP), in which given two lattices L1 and L2 the goal is to decide whether there exists an orthogonal linear transformation mapping L1 to L2. Our main result is an algorithm for this problem running in time nO(n) times a polynomial in the input size, where n is the rank of the input lattices. A crucial component is a new generalized isolation lemma, whic...
متن کاملOn the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملThe Graph Isomorphism Problem
The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...
متن کاملRecent Progress on the Isomorphism Problem
A long-standing problem, posed first by Graham Higman in 1940 [Hi] and later by Brauer [Br], is the “isomorphism problem for integral group rings.” Given finite groups G and H, is it true that ZG N ZH implies G N H? Many authors have worked on this question but progress has been difficult [Sal. Perhaps the best positive result was that of Whitcomb in 1968 [Wh], who showed that the implication G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 2021
ISSN: ['1432-0622', '0938-1279']
DOI: https://doi.org/10.1007/s00200-021-00529-0